A Bijective Proof of Garsia's q-Lagrange Inversion Theorem
نویسنده
چکیده
A q-Lagrange inversion theorem due to A. M. Garsia is proved by means of two sign-reversing, weight-preserving involutions on Catalan trees.
منابع مشابه
Lagrange Inversion and Schur Functions
Macdonald defined an involution on symmetric functions by considering the Lagrange inverse of the generating function of the complete homogeneous symmetric functions. The main result we prove in this note is that the images of skew Schur functions under this involution are either Schur positive or Schur negative symmetric functions. The proof relies on the combinatorics of Lagrange inversion. W...
متن کاملA Bijective Proof of a Major Index Theorem of Garsia and Gessel
In this paper we provide a bijective proof of a theorem of Garsia and Gessel describing the generating function of the major index over the set of all permutations of [n] = {1, ..., n} which are shuffles of given disjoint ordered sequences π1, ..., πk whose union is [n]. The proof is based on a result (an “insertion lemma”) of Haglund, Loehr, and Remmel which describes the change in major index...
متن کاملNon-commutative Extensions of the Macmahon Master Theorem
We present several non-commutative extensions of the MacMahon Master Theorem, further extending the results of Cartier-Foata and Garoufalidis-LêZeilberger. The proofs are combinatorial and new even in the classical cases. We also give applications to the β-extension and Krattenthaler-Schlosser’s q-analogue. Introduction The MacMahon Master Theorem is one of the jewels in enumerative combinatori...
متن کاملEnumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We define a notion of ‘connectivity’ for these objects and prove an analogous product formula which counts connected objects by type. Our proof of this product ...
متن کاملAn Extension of MacMahon's Equidistribution Theorem to Ordered Multiset Partitions
A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work, we prove a strengthening of MacMahon’s theorem originally conjectured by Haglund. Our result can be seen as an equidistribution theorem over the ordered partitions of a multiset into sets, which we call ordered multiset partitions. Our proof...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 5 شماره
صفحات -
تاریخ انتشار 1998